291 Programming Assignment # 3

نویسندگان

  • William Fedus
  • Bobak Hashemi
  • Matthew Burns
چکیده

We train two convolutional neural networks on the POFA and NimStim datasets to identify individuals and identify emotions, respectively. In order to train these neural networks, we use two separate optimization procedures, the minFunc package and stochastic gradient descent. The minFunc optimization package achieved a 95.8% on the training set and achieved a 90.0% accuracy on the partitioned test set. Stochastic gradient descent achieved a 99.4% accuracy on the training set and a 89.7% accuracy on the partitioned test set. The minFunc optimization packaged achieved a 91.7% on the training set and achieved a 78.6% accuracy on the partitioned test set. Stochastic gradient descent achieved a 91.7% accuracy on the training set and a 77.2% accuracy on the partitioned test set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem library. Journal on Global Optimiza...

متن کامل

Bus Assignment to Iranian Pilgrims During Pilgrimage

Among the multitude of activities of Hajj Organization which require careful planning bus assignment to the Iranian pilgrim caravans d g pilgrimage is the most important one. The objective of this assignment is to have a minimum number o standing passengers/empty seats, while satisfying a large number of operational and religious constrain. This problem was formulated as a large scale zero-one ...

متن کامل

A New Approach for Solving Grey Assignment Problems

Linear assignment problem is one of the most important practical models in the literature of linear programming problems‎. ‎Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach‎. ‎In this way‎, ‎some researchers have used a whitening technique to solve the grey assignment p...

متن کامل

Design of single-sampling inspection-plan approach by mathematical programming and linear assignment method

This study proposes a new approach for single-sampling plan by determining sample size and acceptance number. The proposed approach is based on a two-step methodology. In the first step: quality management step, different single sampling inspection plans were generated by running an optimization model for different possible acceptance numbers. While, in the second step: Multi-Attribute Decision...

متن کامل

Integrating Goal Programming, Taylor Series, Kuhn-Tucker Conditions, and Penalty Function Approaches to Solve Linear Fractional Bi-level Programming Problems

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015